A Finite State Mobile Agent Computation Model

نویسندگان

  • Yong Liu
  • Congfu Xu
  • Zhaohui Wu
  • Weidong Chen
  • Yunhe Pan
چکیده

In this paper, a novel formalized finite state mobile agent computation model based on the virtual organization is presented. In this model, all the actions (e.g. service, migration and communication etc.) of the mobile agents are treated as states. The process of the mobile agents’ workflow is controlled by a finite-state-machine. This ensures the atomic action for each mobile agent to avoid the abnormal condition of communication mismatch, which is very common in the traditional mobile agent systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Virtual Organization Based Mobile Agent Computation Model

Mobile agent has developed for decade, and widely implemented in distribute computation. However, traditional mobile agents including strongmigration and weak-migration mobile agents still have some weakness. With the fabric of Grid virtual organization architecture, the mobile agent has gain great advantage comparing to those old mobile agents system. In this paper, a novel formalized mobile a...

متن کامل

An Introduction to Population Protocols

The population protocol model describes a collection of tiny mobile agents that interact with one another to carry out a computation. The agents are identically programmed finite state machines. Interactions between pairs of agents cause the two agents to update their states. These interactions are scheduled by an adversary, subject to a fairness constraint. Input values are initially distribut...

متن کامل

DRAFT—NOT FOR PUBLIC CIRCULATION Date: 2004/09/25 00:18:56; Revision: 1.90.2.3 Computation in Networks of Passively Mobile Finite-State Sensors

The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on pairwise interactions of finite-state agents in populations of finite but unbounded size are defined. With a fairness condition on interactions, the concept of stable computation of a function or predicate is defined. Protocols are given that stably compute any predica...

متن کامل

Simulating a Finite State Mobile Agent System

This paper analyzes the simulation of Finite State mobile agent, which regards the migration, execution, and searching of the mobile agents as finite states. As the finite state mobile agents are deployed under the virtual organization platform, the corresponding search algorithm in virtual organization is also introduced. The experiments results based on the finite mobile agent’s evaluation mo...

متن کامل

A Formal Petri Net Based Model for Antivirus Update Agent System

In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004